Information-driven Sensor Path Planning and the Treasure Hunt Problem
نویسنده
چکیده
Engineering—Mechanical) INFORMATION-DRIVEN SENSOR PATH PLANNING AND THE TREASURE HUNT PROBLEM by Chenghui Cai Department of Mechanical Engineering and Materials Science Duke University
منابع مشابه
Heuristic-Driven “Treasure Hunt” with Linear Performance Guarantees
Consider the task of reaching a goal state in a partially or completely unknown domain. To accomplish such a task search algorithms have to explore the domain sufficiently to locate a goal state and a path leading to it, performing therefore what we call uninformed “treasure hunt.” Very often prior knowledge in the form of heuristic values estimating distances towards the goal state is readily ...
متن کاملA multiple criteria algorithm for planning the itinerary of mobile sink in wireless sensor networks
The mobile sink can increase the efficiency of wireless sensor networks. It moves in a monitored environment and collects the network nodes information. Thus, by the sink we can balance the power consumption and increases the network lifetime. Determining path of the sink's movement is usually modeled as an optimization problem where finding optimal solutions require collecting value of all the...
متن کاملTraditional Fermented Indian Foods: A Treasure Hunt for Rare Lactic Acid Bacteria
This article has no abstract. DOI: 10.18502/jfqhc.6.2.952
متن کامل3D Path Planning Algorithm for Mobile Anchor-Assisted Positioning in Wireless Sensor Networks
Positioning service is one of Wireless Sensor Networks’ (WSNs) fundamental services. The accurate position of the sensor nodes plays a vital role in many applications of WSNs. In this paper, a 3D positioning algorithm is being proposed, using mobile anchor node to assist sensor nodes in order to estimate their positions in a 3D geospatial environment. However, mobile anchor node’s 3D path optim...
متن کاملFaster Treasure Hunt and Better Strongly Universal Exploration Sequences
In this paper, we investigate the explicit deterministic treasure hunt problem in a n-vertex network. This problem was firstly introduced by Ta-Shma and Zwick in [10] [SODA’07]. Note also it is a variant of the well known rendezvous problem in which one of the robot (the treasure) is always stationary. In this paper, we propose an O(n 1 λ )-time algorithm for the treasure hunt problem, which si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008